Grassmann Codes and Schubert Unions

نویسندگان

  • Johan P. Hansen
  • Trygve Johnsen
  • Kristian Ranestad
چکیده

— We study subsets of Grassmann varieties G(l, m) over a field F , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study such sets in detail, and give applications to coding theory, in particular for Grassmann codes. For l = 2 much is known about such Schubert unions with a maximal number of Fq-rational points for a given spanning dimension. We study the case l = 3 and give a conjecture for general l. We also define Schubert union codes in general, and study the parameters and support weights of these codes. Résumé (Codes de Grassmann et unions de cycles de Schubert). — Soit G(l, n) une grassmannienne sur un corps F . Nous étudions les sous-ensembles de G qui sont unions de cycles de Schubert, relativement à un drapeau fixe. Nous les étudions en détail, et donnons les applications à la théorie des codes de Grassmann. Dans le cas l = 2 on sait beaucoup de choses sur les unions de cycles de Schubert ayant un nombre maximal de point Fq-rationnels dont l’image par l’application de Plücker engendre un sous-espace de dimension donnée. Nous étudions le cas l = 3 et faisons une conjecture pour le cas général. Nous définissons les codes unions de Schubert en général, et nous étudions les paramètres et les poids des supports pour ces codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schubert unions in Grassmann varieties

We study subsets of Grassmann varieties G(l, m) over a field F , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study the linear spans of, and in case of positive characteristic, the number of Fq-rational points on such unions. Moreover we study a geometric duality of such unions, and give a combinatorial interpretation of this duality. We discuss the ma...

متن کامل

Higher weights of Grassmann codes in terms of properties of Schubert unions

We describe the higher weights of the Grassmann codes G(2, m) over finite fields Fq in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in q.

متن کامل

SCHUBERT UNIONS AND CODES ON l - STEP FLAG VARIETIES

— In Section 1 we define and study Schubert unions on l-step flag varieties. This has previously been done in the Grassmann case, i.e., the l = 1 case, by Hansen, Johnsen and Ranestad [7]. In Section 2 we study the algebraic codes given by mapping l-step flag varieties into projective space. This subject has also been treated in the Grassmann case previously (see p. 52). Résumé (Unions de cellu...

متن کامل

Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes

We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert varieties in Grassmannians. In geometric terms, this corresponds to determining the maximum number of Fq-rational points on sections of Schubert varieties (with nondegenerate Plücker embedding) by linear subvarieties of a fixed (...

متن کامل

Gröbner Bases for Schubert Codes

We consider the problem of determining Gröbner bases of binomial ideals associated with linear error correcting codes. Computation of Gröbner bases of linear codes have become a topic of interest to many researchers in coding theory because of its several applications in decoding and error corrections. In this paper, Gröbner bases of linear codes associated to Grassmann varieties and Schubert v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010